$\ell_0$TV: A Sparse Optimization Method for Impulse Noise Image Restoration

نویسندگان

  • Ganzhao Yuan
  • Bernard Ghanem
چکیده

Total Variation (TV) is an effective and popular prior model in the field of regularization-based image processing. This paper focuses on total variation for removing impulse noise in image restoration. This type of noise frequently arises in data acquisition and transmission due to many reasons, e.g. a faulty sensor or analog-to-digital converter errors. Removing this noise is an important task in image restoration. State-of-the-art methods such as Adaptive Outlier Pursuit(AOP) [57], which is based on TV with `02-norm data fidelity, only give sub-optimal performance. In this paper, we propose a new sparse optimization method, called `0T V -PADMM, which solves the TV-based restoration problem with `0-norm data fidelity. To effectively deal with the resulting non-convex non-smooth optimization problem, we first reformulate it as an equivalent biconvex Mathematical Program with Equilibrium Constraints (MPEC), and then solve it using a proximal Alternating Direction Method of Multipliers (PADMM). Our `0T V -PADMM method finds a desirable solution to the original `0-norm optimization problem and is proven to be convergent under mild conditions. We apply `0T V -PADMM to the problems of image denoising and deblurring in the presence of impulse noise. Our extensive experiments demonstrate that `0T V -PADMM outperforms state-of-the-art image restoration methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ℓ0TV: A new method for image restoration in the presence of impulse noise

Total Variation (TV) is an effective and popular prior model in the field of regularization-based image processing. This paper focuses on TV for image restoration in the presence of impulse noise. This type of noise frequently arises in data acquisition and transmission due to many reasons, e.g. a faulty sensor or analog-to-digital converter errors. Removing this noise is an important task in i...

متن کامل

Hyperspectral Image Restoration via Total Variation Regularized Low-rank Tensor Decomposition

Hyperspectral images (HSIs) are often corrupted by a mixture of several types of noise during the acquisition process, e.g., Gaussian noise, impulse noise, dead lines, stripes, and many others. Such complex noise could degrade the quality of the acquired HSIs, limiting the precision of the subsequent processing. In this paper, we present a novel tensor-based HSI restoration approach by fully id...

متن کامل

Total Variation with Overlapping Group Sparsity for Image Deblurring under Impulse Noise

The total variation (TV) regularization method is an effective method for image deblurring in preserving edges. However, the TV based solutions usually have some staircase effects. In order to alleviate the staircase effects, we propose a new model for restoring blurred images under impulse noise. The model consists of an ℓ1-fidelity term and a TV with overlapping group sparsity (OGS) regulariz...

متن کامل

Restoration of images corrupted by mixed Gaussian-impulse noise via l1-l0 minimization

In this paper, we study the restoration of images corrupted by Gaussian plus impulse noise, and propose a l1–l0 minimization approach where the l1 term is used for impulse denoising and the l0 term is used for a sparse representation over certain unknown dictionary of images patches. The main algorithm contains three phases. The first phase is to identify the outlier candidates which are likely...

متن کامل

Half-Quadratic Algorithm for ℓp - ℓq Problems with Applications to TV-ℓ1 Image Restoration and Compressive Sensing

In this paper, we consider the `p-`q minimization problem with 0 < p, q ≤ 2. The problem has been studied extensively in image restoration and compressive sensing. In the paper, we first extend the half-quadratic technique from `1-norm to `p-norm with 0 < p < 2. Based on this, we develop a half-quadratic algorithm to solve the `p-`q problem. We prove that our algorithm is indeed a majorize-mini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018